Efficient Algorithm for Overlap-Join
نویسندگان
چکیده
منابع مشابه
An Efficient Parallel Algorithm for High Dimensional Similarity Join
Multidimensional similarity join finds pairs of multidimensional points that are within some small distance of each other. The -k-d-B tree has been proposed as a data structure that scales better as the number of dimensions increases compared to previous data structures. We present a cost model of the -k-d-B tree and use it to optimize the leaf
متن کاملEarly Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results
Minimizing both the response time to produce the first few thousand results and the overall execution time is important for interactive querying. Current join algorithms either minimize the execution time at the expense of response time or minimize response time by producing results early without optimizing the total time. We present a hashbased join algorithm, called early hash join, which can...
متن کاملEfficient Self-Join Algorithm in Interval-based Temporal Data Models
Interval-based temporal data model is a popular data model in temporal databases. It uses time intervals for representing the period of validity of a tuple, leading to unavoidable self-joins when combining tuples for objects. It requires k + 1-way self-join for k conjunctive conditions. Join operations are one of the most expensive operations in databases and they are even more serious in tempo...
متن کاملAn Efficient Parallel Join Algorithm Based On Hypercube-Partitioning
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk I t 0 and CPU costs. The communication cost, however, is also an important factor that can significantly affect the join processing performance in multiprocessor system. In this paper we propose an eficient parallel join algorithm, called CubeRobust, for hypercube multicomputer...
متن کاملAn Efficient Similarity Join Algorithm with Cosine Similarity Predicate
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation time of similarity join is critical issue, since similarity join requires computing similarity values for all possible pairs of objects. Several existing algorithms adopt prefix filtering to avoid unnecessary similari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2010
ISSN: 1812-5638
DOI: 10.3923/itj.2011.201.206